SEARCHING POLYHEDRA BY ROTATING HALF-PLANES
نویسندگان
چکیده
منابع مشابه
Searching Polyhedra by rotating half-Planes
The Searchlight Scheduling Problem was first studied in 2D polygons, where the goal is for point guards in fixed positions to rotate searchlights to catch an evasive intruder. Here the problem is extended to 3D polyhedra, with the guards now boundary segments who rotate half-planes of illumination. After carefully detailing the 3D model, several results are established. The first is a nearly di...
متن کاملGuarding and Searching Polyhedra
Guarding and searching problems have been of fundamental interest since the early years of Computational Geometry. Both are well-developed areas of research and have been thoroughly studied in planar polygonal settings. In this thesis we tackle the Art Gallery Problem and the Searchlight Scheduling Problem in 3-dimensional polyhedral environments, putting special emphasis on edge guards and ort...
متن کاملMoving Porous Half-Planes
A shear flow motivated by relatively moving half-planes is theoretically studied in this paper. Either the mass influx or the mass efflux is allowed on the boundary. This flow is called the extended Stokes’ problems. Traditionally, exact solutions to the Stokes’ problems can be readily obtained by directly applying the integral transforms to the momentum equation and the associated boundary and...
متن کاملCracked piezoelectric layer bounded between two orthotropic half-planes
This paper deals with the behavior of anti-plane shear crack in a piezoelectric layer bounded between two orthotropic half-planes within the framework of linear electroelasticity. The crack surfaces are assumed to be permeable or impermeable. The analysis is based on the stress fields caused by Volterra-type screw dislocation in the medium. Fourier transforms are used to reduce the dislocation ...
متن کاملColoring geometric hypergraph defined by an arrangement of half-planes
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2012
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195912500070